0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n010.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 06:12:54 EDT 2024 0.12/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.UFfANofPyw/E---3.1_3036.p 0.20/0.50 # Version: 3.2.0-ho 0.20/0.50 # Preprocessing class: HSMSSMSSSSSNFFN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.50 # Starting new_ho_10 with 900s (5) cores 0.20/0.50 # Starting new_bool_1 with 180s (1) cores 0.20/0.50 # Starting full_lambda_5 with 180s (1) cores 0.20/0.50 # Starting new_ho_10_unif with 180s (1) cores 0.20/0.50 # new_bool_1 with pid 3115 completed with status 0 0.20/0.50 # Result found by new_bool_1 0.20/0.50 # Preprocessing class: HSMSSMSSSSSNFFN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.50 # Starting new_ho_10 with 900s (5) cores 0.20/0.50 # Starting new_bool_1 with 180s (1) cores 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.20/0.50 # Search class: HHUNS-FFSM11-SFFFFFNN 0.20/0.50 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.20/0.50 # Starting new_ho_10 with 109s (1) cores 0.20/0.50 # new_ho_10 with pid 3120 completed with status 0 0.20/0.50 # Result found by new_ho_10 0.20/0.50 # Preprocessing class: HSMSSMSSSSSNFFN. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.50 # Starting new_ho_10 with 900s (5) cores 0.20/0.50 # Starting new_bool_1 with 180s (1) cores 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.20/0.50 # Search class: HHUNS-FFSM11-SFFFFFNN 0.20/0.50 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.20/0.50 # Starting new_ho_10 with 109s (1) cores 0.20/0.50 # Preprocessing time : 0.001 s 0.20/0.50 # Presaturation interreduction done 0.20/0.50 0.20/0.50 # Proof found! 0.20/0.50 # SZS status Theorem 0.20/0.50 # SZS output start CNFRefutation 0.20/0.50 thf(decl_22, type, cQ_4: $i > $i > $i > $o). 0.20/0.50 thf(decl_23, type, f: $i > $i). 0.20/0.50 thf(decl_24, type, cP_3: $i > $i > $o). 0.20/0.50 thf(decl_25, type, cQ_3: $i > $i > $i > $o). 0.20/0.50 thf(decl_26, type, d: $i). 0.20/0.50 thf(decl_27, type, c: $i). 0.20/0.50 thf(decl_28, type, b: $i). 0.20/0.50 thf(decl_29, type, a: $i). 0.20/0.50 thf(decl_30, type, cP_2: $i > $i > $o). 0.20/0.50 thf(decl_31, type, cQ_2: $i > $i > $i > $o). 0.20/0.50 thf(decl_32, type, cP_1: $i > $i > $o). 0.20/0.50 thf(decl_33, type, cQ_1: $i > $i > $i > $o). 0.20/0.50 thf(cTHM409_3, conjecture, ~(((((((((((((((((((((cP_1 @ a @ a)&(cP_1 @ c @ c))&![X1:$i]:((cP_1 @ d @ X1)))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~((cQ_1 @ X1 @ X2 @ X3))|~((cP_1 @ (f @ X1) @ X4))|(cQ_2 @ X4 @ X5 @ X6)|~((cP_1 @ (f @ X3) @ X6))|~((cP_1 @ (f @ X2) @ X5)))))&(cP_2 @ c @ c))&(cP_3 @ a @ a))&(cP_3 @ b @ b))&(cP_3 @ c @ c))&![X1:$i, X2:$i]:(((cP_3 @ (f @ X1) @ X2)|~((cP_3 @ X1 @ X2)))))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~((cQ_3 @ X1 @ X2 @ X3))|~((cP_3 @ (f @ X2) @ X5))|(cQ_4 @ X4 @ X5 @ X6)|~((cP_3 @ (f @ X3) @ X6))|~((cP_3 @ (f @ X1) @ X4)))))&![X1:$i, X2:$i, X3:$i]:(~((cQ_4 @ X1 @ X2 @ X3))))&![X1:$i]:((cP_3 @ d @ X1)))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~((cP_2 @ (f @ X1) @ X4))|(cQ_3 @ X4 @ X5 @ X6)|~((cP_2 @ (f @ X3) @ X6))|~((cP_2 @ (f @ X2) @ X5))|~((cQ_2 @ X1 @ X2 @ X3)))))&![X1:$i, X2:$i]:((~((cP_2 @ X1 @ X2))|(cP_2 @ (f @ X1) @ X2))))&![X1:$i]:((cP_2 @ d @ X1)))&(cP_2 @ b @ b))&(cP_2 @ a @ a))&![X1:$i, X2:$i]:((~((cP_1 @ X1 @ X2))|(cP_1 @ (f @ X1) @ X2))))&(cP_1 @ b @ b))&(cQ_1 @ a @ b @ c))), file('/export/starexec/sandbox/tmp/tmp.UFfANofPyw/E---3.1_3036.p', cTHM409_3)). 0.20/0.50 thf(c_0_1, negated_conjecture, ~(~(((((((((((((((((((((cP_1 @ a @ a)&(cP_1 @ c @ c))&![X1:$i]:((cP_1 @ d @ X1)))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~(cQ_1 @ X1 @ X2 @ X3)|~(cP_1 @ (f @ X1) @ X4)|(cQ_2 @ X4 @ X5 @ X6)|~(cP_1 @ (f @ X3) @ X6)|~(cP_1 @ (f @ X2) @ X5))))&(cP_2 @ c @ c))&(cP_3 @ a @ a))&(cP_3 @ b @ b))&(cP_3 @ c @ c))&![X1:$i, X2:$i]:(((cP_3 @ (f @ X1) @ X2)|~(cP_3 @ X1 @ X2))))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~(cQ_3 @ X1 @ X2 @ X3)|~(cP_3 @ (f @ X2) @ X5)|(cQ_4 @ X4 @ X5 @ X6)|~(cP_3 @ (f @ X3) @ X6)|~(cP_3 @ (f @ X1) @ X4))))&![X1:$i, X2:$i, X3:$i]:(~(cQ_4 @ X1 @ X2 @ X3)))&![X1:$i]:((cP_3 @ d @ X1)))&![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~(cP_2 @ (f @ X1) @ X4)|(cQ_3 @ X4 @ X5 @ X6)|~(cP_2 @ (f @ X3) @ X6)|~(cP_2 @ (f @ X2) @ X5)|~(cQ_2 @ X1 @ X2 @ X3))))&![X1:$i, X2:$i]:((~(cP_2 @ X1 @ X2)|(cP_2 @ (f @ X1) @ X2))))&![X1:$i]:((cP_2 @ d @ X1)))&(cP_2 @ b @ b))&(cP_2 @ a @ a))&![X1:$i, X2:$i]:((~(cP_1 @ X1 @ X2)|(cP_1 @ (f @ X1) @ X2))))&(cP_1 @ b @ b))&(cQ_1 @ a @ b @ c)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM409_3])])). 0.20/0.50 thf(c_0_2, negated_conjecture, ![X37:$i, X38:$i, X39:$i, X40:$i, X41:$i, X42:$i, X43:$i, X44:$i, X45:$i, X46:$i, X47:$i, X48:$i, X49:$i, X50:$i, X51:$i, X52:$i, X53:$i, X54:$i, X55:$i, X56:$i, X57:$i, X58:$i, X59:$i, X60:$i, X61:$i, X62:$i, X63:$i, X64:$i, X65:$i, X66:$i]:(((((((((((((((((((((cP_1 @ a @ a)&(cP_1 @ c @ c))&(cP_1 @ d @ X37))&(~(cQ_1 @ X38 @ X39 @ X40)|~(cP_1 @ (f @ X38) @ X41)|(cQ_2 @ X41 @ X42 @ X43)|~(cP_1 @ (f @ X40) @ X43)|~(cP_1 @ (f @ X39) @ X42)))&(cP_2 @ c @ c))&(cP_3 @ a @ a))&(cP_3 @ b @ b))&(cP_3 @ c @ c))&((cP_3 @ (f @ X44) @ X45)|~(cP_3 @ X44 @ X45)))&(~(cQ_3 @ X46 @ X47 @ X48)|~(cP_3 @ (f @ X47) @ X50)|(cQ_4 @ X49 @ X50 @ X51)|~(cP_3 @ (f @ X48) @ X51)|~(cP_3 @ (f @ X46) @ X49)))&~(cQ_4 @ X52 @ X53 @ X54))&(cP_3 @ d @ X55))&(~(cP_2 @ (f @ X56) @ X59)|(cQ_3 @ X59 @ X60 @ X61)|~(cP_2 @ (f @ X58) @ X61)|~(cP_2 @ (f @ X57) @ X60)|~(cQ_2 @ X56 @ X57 @ X58)))&(~(cP_2 @ X62 @ X63)|(cP_2 @ (f @ X62) @ X63)))&(cP_2 @ d @ X64))&(cP_2 @ b @ b))&(cP_2 @ a @ a))&(~(cP_1 @ X65 @ X66)|(cP_1 @ (f @ X65) @ X66)))&(cP_1 @ b @ b))&(cQ_1 @ a @ b @ c))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.20/0.50 thf(c_0_3, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i, X6:$i, X5:$i]:(((cQ_2 @ X4 @ X5 @ X6)|~((cQ_1 @ X1 @ X2 @ X3))|~((cP_1 @ (f @ X1) @ X4))|~((cP_1 @ (f @ X3) @ X6))|~((cP_1 @ (f @ X2) @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_4, negated_conjecture, ![X1:$i, X2:$i]:(((cP_1 @ (f @ X1) @ X2)|~((cP_1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_5, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i, X6:$i, X5:$i]:(((cQ_3 @ X2 @ X3 @ X4)|~((cP_2 @ (f @ X1) @ X2))|~((cP_2 @ (f @ X5) @ X4))|~((cP_2 @ (f @ X6) @ X3))|~((cQ_2 @ X1 @ X6 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_6, negated_conjecture, ![X1:$i, X2:$i]:(((cP_2 @ (f @ X1) @ X2)|~((cP_2 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_7, negated_conjecture, ![X1:$i, X2:$i, X4:$i, X6:$i, X5:$i, X3:$i]:(((cQ_2 @ X1 @ X2 @ X3)|~((cP_1 @ (f @ X4) @ X2))|~((cP_1 @ (f @ X5) @ X1))|~((cQ_1 @ X5 @ X4 @ X6))|~((cP_1 @ X6 @ X3)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.20/0.50 thf(c_0_8, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X6:$i, X5:$i, X2:$i]:(((cQ_3 @ X1 @ X2 @ X3)|~((cP_2 @ (f @ X4) @ X3))|~((cP_2 @ (f @ X5) @ X1))|~((cQ_2 @ X5 @ X6 @ X4))|~((cP_2 @ X6 @ X2)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.20/0.50 thf(c_0_9, negated_conjecture, ![X1:$i, X4:$i, X6:$i, X5:$i, X3:$i, X2:$i]:(((cQ_2 @ X1 @ X2 @ X3)|~((cP_1 @ (f @ X4) @ X1))|~((cQ_1 @ X4 @ X5 @ X6))|~((cP_1 @ X6 @ X3))|~((cP_1 @ X5 @ X2)))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 0.20/0.50 thf(c_0_10, negated_conjecture, ![X1:$i, X2:$i, X5:$i, X6:$i, X4:$i, X3:$i]:(((cQ_3 @ X1 @ X2 @ X3)|~((cP_2 @ (f @ X4) @ X1))|~((cQ_2 @ X4 @ X5 @ X6))|~((cP_2 @ X5 @ X2))|~((cP_2 @ X6 @ X3)))), inference(spm,[status(thm)],[c_0_8, c_0_6])). 0.20/0.50 thf(c_0_11, negated_conjecture, ![X2:$i, X6:$i, X5:$i, X4:$i, X3:$i, X1:$i]:(((cQ_2 @ X1 @ X2 @ X3)|~((cQ_1 @ X4 @ X5 @ X6))|~((cP_1 @ X6 @ X3))|~((cP_1 @ X5 @ X2))|~((cP_1 @ X4 @ X1)))), inference(spm,[status(thm)],[c_0_9, c_0_4])). 0.20/0.50 thf(c_0_12, negated_conjecture, (cQ_1 @ a @ b @ c), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_13, negated_conjecture, ![X3:$i, X2:$i, X1:$i, X4:$i, X6:$i, X5:$i]:(((cQ_4 @ X5 @ X4 @ X6)|~((cQ_3 @ X1 @ X2 @ X3))|~((cP_3 @ (f @ X2) @ X4))|~((cP_3 @ (f @ X3) @ X6))|~((cP_3 @ (f @ X1) @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_14, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(~((cQ_4 @ X1 @ X2 @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_15, negated_conjecture, ![X2:$i, X5:$i, X6:$i, X4:$i, X3:$i, X1:$i]:(((cQ_3 @ X1 @ X2 @ X3)|~((cQ_2 @ X4 @ X5 @ X6))|~((cP_2 @ X5 @ X2))|~((cP_2 @ X6 @ X3))|~((cP_2 @ X4 @ X1)))), inference(spm,[status(thm)],[c_0_10, c_0_6])). 0.20/0.50 thf(c_0_16, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((cQ_2 @ X1 @ X2 @ X3)|~((cP_1 @ c @ X3))|~((cP_1 @ b @ X2))|~((cP_1 @ a @ X1)))), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.20/0.50 thf(c_0_17, negated_conjecture, ![X6:$i, X5:$i, X4:$i, X3:$i, X2:$i, X1:$i]:((~((cP_3 @ (f @ X1) @ X2))|~((cP_3 @ (f @ X3) @ X4))|~((cP_3 @ (f @ X5) @ X6))|~((cQ_3 @ X5 @ X3 @ X1)))), inference(sr,[status(thm)],[c_0_13, c_0_14])). 0.20/0.50 thf(c_0_18, negated_conjecture, ![X1:$i, X2:$i]:(((cP_3 @ (f @ X1) @ X2)|~((cP_3 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_19, negated_conjecture, ![X3:$i, X2:$i, X5:$i, X6:$i, X4:$i, X1:$i]:(((cQ_3 @ X1 @ X2 @ X3)|~((cP_1 @ c @ X4))|~((cP_1 @ b @ X5))|~((cP_1 @ a @ X6))|~((cP_2 @ X5 @ X2))|~((cP_2 @ X4 @ X3))|~((cP_2 @ X6 @ X1)))), inference(spm,[status(thm)],[c_0_15, c_0_16])). 0.20/0.50 thf(c_0_20, negated_conjecture, (cP_1 @ c @ c), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_21, negated_conjecture, ![X1:$i, X3:$i, X2:$i, X4:$i, X5:$i, X6:$i]:((~((cP_3 @ (f @ X1) @ X2))|~((cP_3 @ (f @ X3) @ X4))|~((cQ_3 @ X3 @ X1 @ X5))|~((cP_3 @ X5 @ X6)))), inference(spm,[status(thm)],[c_0_17, c_0_18])). 0.20/0.50 thf(c_0_22, negated_conjecture, ![X2:$i, X4:$i, X5:$i, X3:$i, X1:$i]:(((cQ_3 @ X1 @ X2 @ X3)|~((cP_1 @ b @ X4))|~((cP_1 @ a @ X5))|~((cP_2 @ c @ X3))|~((cP_2 @ X4 @ X2))|~((cP_2 @ X5 @ X1)))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.20/0.50 thf(c_0_23, negated_conjecture, (cP_1 @ b @ b), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_24, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~((cP_3 @ (f @ X1) @ X2))|~((cQ_3 @ X1 @ X3 @ X4))|~((cP_3 @ X4 @ X5))|~((cP_3 @ X3 @ X6)))), inference(spm,[status(thm)],[c_0_21, c_0_18])). 0.20/0.50 thf(c_0_25, negated_conjecture, ![X2:$i, X4:$i, X3:$i, X1:$i]:(((cQ_3 @ X1 @ X2 @ X3)|~((cP_1 @ a @ X4))|~((cP_2 @ c @ X3))|~((cP_2 @ b @ X2))|~((cP_2 @ X4 @ X1)))), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.20/0.50 thf(c_0_26, negated_conjecture, (cP_1 @ a @ a), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_27, negated_conjecture, ![X3:$i, X2:$i, X1:$i, X4:$i, X5:$i, X6:$i]:((~((cQ_3 @ X1 @ X2 @ X3))|~((cP_3 @ X3 @ X4))|~((cP_3 @ X2 @ X5))|~((cP_3 @ X1 @ X6)))), inference(spm,[status(thm)],[c_0_24, c_0_18])). 0.20/0.50 thf(c_0_28, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((cQ_3 @ X1 @ X2 @ X3)|~((cP_2 @ c @ X3))|~((cP_2 @ b @ X2))|~((cP_2 @ a @ X1)))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.20/0.50 thf(c_0_29, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i, X6:$i]:((~((cP_2 @ c @ X1))|~((cP_2 @ b @ X2))|~((cP_2 @ a @ X3))|~((cP_3 @ X1 @ X4))|~((cP_3 @ X2 @ X5))|~((cP_3 @ X3 @ X6)))), inference(spm,[status(thm)],[c_0_27, c_0_28])). 0.20/0.50 thf(c_0_30, negated_conjecture, (cP_2 @ c @ c), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_31, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i, X5:$i]:((~((cP_2 @ b @ X1))|~((cP_2 @ a @ X2))|~((cP_3 @ c @ X3))|~((cP_3 @ X1 @ X4))|~((cP_3 @ X2 @ X5)))), inference(spm,[status(thm)],[c_0_29, c_0_30])). 0.20/0.50 thf(c_0_32, negated_conjecture, (cP_2 @ b @ b), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_33, negated_conjecture, ![X1:$i, X2:$i, X3:$i, X4:$i]:((~((cP_2 @ a @ X1))|~((cP_3 @ c @ X2))|~((cP_3 @ b @ X3))|~((cP_3 @ X1 @ X4)))), inference(spm,[status(thm)],[c_0_31, c_0_32])). 0.20/0.50 thf(c_0_34, negated_conjecture, (cP_2 @ a @ a), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_35, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((~((cP_3 @ c @ X1))|~((cP_3 @ b @ X2))|~((cP_3 @ a @ X3)))), inference(spm,[status(thm)],[c_0_33, c_0_34])). 0.20/0.50 thf(c_0_36, negated_conjecture, (cP_3 @ c @ c), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_37, negated_conjecture, ![X1:$i, X2:$i]:((~((cP_3 @ b @ X1))|~((cP_3 @ a @ X2)))), inference(spm,[status(thm)],[c_0_35, c_0_36])). 0.20/0.50 thf(c_0_38, negated_conjecture, (cP_3 @ b @ b), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_39, negated_conjecture, (cP_3 @ a @ a), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 thf(c_0_40, negated_conjecture, ![X1:$i]:(~((cP_3 @ a @ X1))), inference(spm,[status(thm)],[c_0_37, c_0_38])). 0.20/0.50 thf(c_0_41, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_39, c_0_40]), ['proof']). 0.20/0.50 # SZS output end CNFRefutation 0.20/0.50 # Parsed axioms : 13 0.20/0.50 # Removed by relevancy pruning/SinE : 12 0.20/0.50 # Initial clauses : 20 0.20/0.50 # Removed in clause preprocessing : 0 0.20/0.50 # Initial clauses in saturation : 20 0.20/0.50 # Processed clauses : 60 0.20/0.50 # ...of these trivial : 0 0.20/0.50 # ...subsumed : 0 0.20/0.50 # ...remaining for further processing : 60 0.20/0.50 # Other redundant clauses eliminated : 0 0.20/0.50 # Clauses deleted for lack of memory : 0 0.20/0.50 # Backward-subsumed : 2 0.20/0.50 # Backward-rewritten : 0 0.20/0.50 # Generated clauses : 21 0.20/0.50 # ...of the previous two non-redundant : 20 0.20/0.50 # ...aggressively subsumed : 0 0.20/0.50 # Contextual simplify-reflections : 0 0.20/0.50 # Paramodulations : 20 0.20/0.50 # Factorizations : 0 0.20/0.50 # NegExts : 0 0.20/0.50 # Equation resolutions : 0 0.20/0.50 # Disequality decompositions : 0 0.20/0.50 # Total rewrite steps : 0 0.20/0.50 # ...of those cached : 0 0.20/0.50 # Propositional unsat checks : 0 0.20/0.50 # Propositional check models : 0 0.20/0.50 # Propositional check unsatisfiable : 0 0.20/0.50 # Propositional clauses : 0 0.20/0.50 # Propositional clauses after purity: 0 0.20/0.50 # Propositional unsat core size : 0 0.20/0.50 # Propositional preprocessing time : 0.000 0.20/0.50 # Propositional encoding time : 0.000 0.20/0.50 # Propositional solver time : 0.000 0.20/0.50 # Success case prop preproc time : 0.000 0.20/0.50 # Success case prop encoding time : 0.000 0.20/0.50 # Success case prop solver time : 0.000 0.20/0.50 # Current number of processed clauses : 37 0.20/0.50 # Positive orientable unit clauses : 12 0.20/0.50 # Positive unorientable unit clauses: 0 0.20/0.50 # Negative unit clauses : 2 0.20/0.50 # Non-unit-clauses : 23 0.20/0.50 # Current number of unprocessed clauses: 0 0.20/0.50 # ...number of literals in the above : 0 0.20/0.50 # Current number of archived formulas : 0 0.20/0.50 # Current number of archived clauses : 23 0.20/0.50 # Clause-clause subsumption calls (NU) : 165 0.20/0.50 # Rec. Clause-clause subsumption calls : 47 0.20/0.50 # Non-unit clause-clause subsumptions : 1 0.20/0.50 # Unit Clause-clause subsumption calls : 9 0.20/0.50 # Rewrite failures with RHS unbound : 0 0.20/0.50 # BW rewrite match attempts : 0 0.20/0.50 # BW rewrite match successes : 0 0.20/0.50 # Condensation attempts : 60 0.20/0.50 # Condensation successes : 0 0.20/0.50 # Termbank termtop insertions : 3172 0.20/0.50 # Search garbage collected termcells : 295 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.005 s 0.20/0.50 # System time : 0.004 s 0.20/0.50 # Total time : 0.010 s 0.20/0.50 # Maximum resident set size: 1904 pages 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.006 s 0.20/0.50 # System time : 0.007 s 0.20/0.50 # Total time : 0.013 s 0.20/0.50 # Maximum resident set size: 1764 pages 0.20/0.50 % E---3.1 exiting 0.20/0.50 % E exiting 0.20/0.50 EOF